Quantum algorithms and the Fourier transform

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Algorithms and the Fourier Transform

The quantum algorithms of Deutsch, Simon and Shor are described in a way which highlights their dependence on the Fourier transform. The general construction of the Fourier transform on an Abelian group is outlined and this provides a unified way of understanding the efficacy of the algorithms. Finally we describe an efficient quantum factoring algorithm based on a general formalism of Kitaev a...

متن کامل

The Universality of the Quantum Fourier Transform in Forming the Basis of Quantum Computing Algorithms

The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P (·), both of which are 2× 2 unitary matrices as operators on the two-dimensional 1-qubit space. In this paper, we show thatH and P (·) suffice to generate the unitary group U(2) and, consequently, through controlled-U operations...

متن کامل

On semifast Fourier transform algorithms

Abstract In this paper, following [1, 2, 3, 4, 5, 6, 7] we consider the relations between well-known Fourier transform algorithms.

متن کامل

Fourier-transform quantum state tomography

We propose a technique for performing quantum state tomography of photonic polarization-encoded multiqubit states. Our method uses a single rotating wave plate, a polarizing beam splitter, and two photon-counting detectors per photon mode. As the wave plate rotates, the photon counters measure a pseudocontinuous signal which is then Fourier transformed. The density matrix of the state is recons...

متن کامل

A quantum Fourier transform algorithm

Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds given earlier. Exact bounds are given for the number of qubits needed to achieve a desired tolerance, allowing simulation of the algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences

سال: 1998

ISSN: 1364-5021,1471-2946

DOI: 10.1098/rspa.1998.0163